Cubic planar hamiltonian graphs of various types
نویسندگان
چکیده
Let U be the set of cubic planar hamiltonian graphs, A the set of graphs G in U such thatG− v is hamiltonian for any vertex v of G, B the set of graphs G in U such thatG− e is hamiltonian for any edge e of G, and C the set of graphs G in U such that there is a hamiltonian path between any two different vertices of G. With the inclusion and/or exclusion of the sets A,B, and C, U is divided into eight subsets. In this paper, we prove that there is an infinite number of graphs in each of the eight subsets. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
New results on hypohamiltonian and almost hypohamiltonian graphs
Consider a non-hamiltonian graph G. G is hypohamiltonian if for every vertex v in G, the graph G − v is hamiltonian. G is almost hypohamiltonian if there exists a vertex w in G such that G−w is non-hamiltonian, and G− v is hamiltonian for every vertex v 6= w. McKay asked in [J. Graph Theory, doi: 10.1002/jgt.22043] whether infinitely many planar cubic hypohamiltonian graphs of girth 5 exist. We...
متن کاملNonhamiltonian 3-Connected Cubic Planar Graphs
We establish that every cyclically 4-connected cubic planar graph of order at most 40 is hamiltonian. Furthermore, this bound is determined to be sharp and we present all nonhamiltonian such graphs of order 42. In addition we list all nonhamiltonian cyclically 5-connected cubic planar graphs of order at most 52 and all nonhamiltonian 3-connected cubic planar graphs of girth 5 on at most 46 vert...
متن کاملPlanar graphs, regular graphs, bipartite graphs and Hamiltonicity: Corrigendum
In [1], page 127, the third last paragraph should be replaced by: It would seem that all 3-connected cubic bipartite graphs on 30 or fewer vertices are, however, Hamiltonian. This result is claimed by Kelmans and Lomonosov, see [2].
متن کاملImproved bounds for hypohamiltonian graphs
A graph G is hypohamiltonian if G is non-hamiltonian and G − v is hamiltonian for every v ∈ V (G). In the following, every graph is assumed to be hypohamiltonian. Aldred, Wormald, and McKay gave a list of all graphs of order at most 17. In this article, we present an algorithm to generate all graphs of a given order and apply it to prove that there exist exactly 14 graphs of order 18 and 34 gra...
متن کاملPerfect one-factorizations in line-graphs and planar graphs
A one-factorization of a regular graph G is perfect if the union of any two one-factors is a Hamiltonian cycle. A graph G is said to be P1F if it possess a perfect one-factorization. We prove that G is a P1F cubic graph if and only if L(G) is a P1F quartic graph. Moreover, we give some necessary conditions for the existence of a P1F planar graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 306 شماره
صفحات -
تاریخ انتشار 2006